GTTI 2008: sessione Trasmissione Numerica Non-binary LDPC codes with good performance on channels affected by bursty noise

نویسندگان

  • Andrea Marinoni
  • Pietro Savazzi
  • Stefano Valle
چکیده

Non-binary Reed-Solomon (RS) codes represent a typical way to counteract the effects of error bursts in hard-disk drives (HDD). Recently, it has been demonstrated how q-ary low-density paritycheck (LDPC) codes can outperform RS codes through a proper construction of the parity check (PC) matrix. In this work, two matrix design schemes, based on the main definitions of erasure burst proposed in literature, are presented. The performance of generated codes are evaluated on bursty noise channels, in order to highlight the main constraint that has to be taken into account for designing LDPC codes with a good burst error correction capability. The proposed schemes have been evaluated on both AWGN and magnetic recording channels in presence of erasure bursts, comparing their coding gain against those obtained by using non-binary RS codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GTTI 2009: sessione Trasmissione Spectrally efficient LDPC coded modulations

In recent times the need of spectral efficiency has become a relevant topic for many communication systems, especially for wireless services. In order to achieve the best tradeoff between bandwidth occupancy and error-rate performance, several structures that involve large constellations have been proposed in literature. This paper focuses on LDPC-coded systems using 16-QAM constellations on a ...

متن کامل

LDPC Codes For The Classic Bursty Channel

In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.

متن کامل

On Multilevel Coding Schemes Based on Non-Binary LDPC Codes

We address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts. Unfortunately, their decoding complexity is still large. In order to reduce the decoding complexity we consider multilevel coding schemes based on non-binary LD...

متن کامل

Finite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders: Stability Conditions on Zm Codes and Cutoff Rate Analysis on Non-symmetric Binary Channels

This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Z m and binary LDPC codes, assuming belief propagation decoding on memoryless channels. Two noise measures will be considered: the Bhattacharyya noise parameter and the soft bit value for a MAP decoder on the uncoded channel. For Z m LDPC codes, an iterative m-dimensional bound is derived for m-ary-input/...

متن کامل

Fourier Transform Decoding of Non-Binary LDPC Codes

Binary low-density parity-check (LDPC) codes have recently emerged as a promising alternative to turbo codes and have been shown to achieve excellent coding gains in AWGN channels. Non-binary LDPC codes have demonstrated improved performance over binary LDPC codes but their decoding is computationally intensive. Fourier transform decoding can reduce the decoding complexity but has a number of p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008